On Efficient Heuristic Ranking of Hypotheses
نویسندگان
چکیده
This paper considers the problem of learning the ranking of a set of alternatives based upon incomplete information (e.g., a limited number of observations). We describe two algorithms for hypothesis ranking and their application for probably approximately correct (PAC) and expected loss (EL) learning criteria. Empirical results are provided to demonstrate the effectiveness of these ranking procedures on both synthetic datasets and real-world data from a spacecraft design optimization problem.
منابع مشابه
Efficient Heuristic Hypothesis Ranking
This paper considers the problem of learning the ranking of' a set of' stochastic alternatives based upon incomplete information (i.e., a limited number of samples). We describe a system that, at each decision cycle, outputs either a complete ordering on the hypotheses or decides to gather additional information (Le., observations) at some cost. The ranking problem is a generalization of the pr...
متن کاملRanking Efficient Decision Making Units in Data Envelopment Analysis based on Changing Reference Set
One of the drawbacks of Data Envelopment Analysis (DEA) is the problem of lack of discrimination among efficient Decision Making Units (DMUs). A method for removing this difficulty is called changing reference set proposed by Jahanshahloo and et.al (2007). The method has some drawbacks. In this paper a modified method and new method to overcome this problems are suggested. The main advantage of...
متن کاملRanking efficient DMUs using the infinity norm and virtual inefficient DMU in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The purpose of this paper is ra...
متن کاملScalable Link-based Personalization for Ranking in Entity-Relationship Graphs
Authority flow techniques like PageRank and ObjectRank can provide personalized ranking of typed entity-relationship graphs. There are two main ways to personalize authority flow ranking: Nodebased personalization, where authority originates from a set of userspecific nodes; Edge-based personalization, where the importance of different edge types is user-specific. We propose for the first time ...
متن کاملRanking of Efficient and Non-Efficient Decision Making Units with Undesirable Data Based on Combined Models of DEA and TOPSIS
Data Envelopment Analysis (DEA) is a method for determining the performance of units under evaluation of DMUs. Each decision-making unit using multiple inputs produces multiple outputs whose nature of outputs may be desirable or undesirable. Units whose performance score equals one are efficient. The concept of ranking decision makers because of the useful information they provide to decision m...
متن کامل